Primitive normal bases for finite fields
نویسندگان
چکیده
منابع مشابه
Normal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملOn the Density of Normal Bases in Finite Fields
Let Fqn denote the finite field with q elements, for q being a prime power. Fqn may be regarded as an n-dimensional vector space over Fq. α ∈ Fqn generates a normal basis for this vector space (Fqn : Fq), if {α,α , αq2 , . . . , αq} are linearly independent over Fq. Let N(q, n) denote the number of elements in Fqn that generate a normal basis for Fqn : Fq, and let ν(q, n) = N(q,n) qn denote the...
متن کاملFinite Fields 5 . 3 Complexity of normal bases
5.3.2 Remark An exhaustive search for normal bases of F2n over F2 for n < 40 is given in [2015], extending previous tables such as those found in [1631]. Using data from the search, the authors in [2015] indicate that normal bases of F2n over F2 follow a normal distribution (with respect to their complexities) which is tightly compacted about a mean of roughly n/2. We define low complexity norm...
متن کاملDickson Bases and Finite Fields
Finite fields have been used for many applications in electronic communications. In the case of extension fields, the nature of computation depends heavily on the choice of basis used to represent the extension over the base field. The most common choices of basis are polynomial bases although optimal normal bases or some variant of these have also been used despite the fact that such bases exi...
متن کاملSearch of Primitive Polynomials over Finite Fields
Let us introduce some notations and definitions: if p denotes a prime integer and n a positive integer, then GF(p”) is the field containing pn elements. a primitive element of GF(p”) is a generator of the cyclic multiplicative group GVP”)*, a manic irreducible polynomial of degree n belonging to GF(p)[X] is called primitive if its roots are primitive elements of GF(p”). These polynomials are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1987
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1987-0866111-3